How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics

نویسندگان

  • Lutz Schröder
  • Dirk Pattinson
چکیده

The modelling of parthood relations in description logics via transitive roles often leads to undecidability when combined with number restrictions and role hierarchies. Here, we introduce the description logic PHQ that explicitly supports reasoning about parthood in the presence of qualified number restrictions. Our main results are completeness and decidability in NEXPTIME. Conceptually, we argue that PHQ provides a better semantic fit for many applications: more often than not, parthoods occurring e.g. in biomedical ontologies are expected to be tree-like. In such cases, PHQ supports stronger inferences than standard description logics. Technically this is achieved by explicitly excluding the merging of descendants, which, at the same time, eliminates the prime source of undecidability. We work in the general setting of coalgebraic modal logic, a generic semantic framework for not-necessarily-normal modal logics. This added generality allows the re-use of many of our results for other logics of sometimes quite different flavour.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational ontologies of parthood, componenthood, and containment

Parthood, componenthood, and containment relations are commonly assumed in biomedical ontologies and terminology systems, but are not usually clearly distinguished from another. This paper contributes towards a unified theory of parthood, componenthood, and containment relations. Our goal in this is to clarify distinctions between these relations as well as principles governing their interrelat...

متن کامل

Finite Model Reasoning in ALCQI is EXPTIME Logics

Most description logics (DLs) enjoy the finite model property (FMP). This is, for example, the case for ALC [14] and many of its extensions such as ALCI (ALC with inverse roles) and ALCQ (ALC with qualifying number restrictions): for any of these logics L, each satisfiable L-concept has a finite model. This even holds if we consider concept satisfiability w.r.t. general TBoxes. However, there a...

متن کامل

How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited

The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, transitive roles or their super-roles—in number restrictions. When modeling composite objects, for example in bio-medical ontologies, this restriction can pose problems. Therefore, we take a closer look at the problem of counting ...

متن کامل

A Proposal for a Glass-Box Approach for Subsumption Checking

Description logics have good representational properties and their computational properties are well understood. However, one of their main drawback is that their current reasoning algorithms have an inherent black-box nature, i.e they don’t make explicit how subsumption inferences are obtained. This is an important drawback for providing explanation or debugging services. Description logics wi...

متن کامل

(Re) Making the Procrustean Bed? Standardization and Customization as Competing Logics in Healthcare

Recent years have witnessed a parallel and seemingly contradictory trend towards both the standardization and the customization of healthcare and medical treatment. Here, we explore what is meant by ‘standardization’ and ‘customization’ in healthcare settings and explore the implications of these changes for healthcare delivery. We frame the paradox of these divergent and opposing factors in te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008